基于VERICUT的偏心放置分段式齿圈铣齿方法研究

为解决大直径且齿宽较宽的分段式齿圈的铣齿问题,提出采用偏心放置的主程序调用子程序循环加工的铣齿方法。根据主程序数学模型和子程序数学模型构建偏心放置铣齿方法的数学模型,基于VERICUT的仿真模型和仿真主、子程序,实现齿槽的开粗和精铣仿真加工;通过VERICUT对比分析功能模块,以齿面残留模型为依据,验证了偏心放置铣齿方法的可行性。     

基于深度学习的传感器优化布置方法

针对传感器优化布置(optimal sensor placement,简称OSP)问题,提出了一种新的使用深度神经网络的解决方案,并以简化的桥梁形状的桁架结构中的振动测试传感器优化为例进行了验证。首先,选择一种传统的传感器优化布置方法,对自动化生成的大量不同的桁架结构分别进行传感器优化布置计算,将所得优化布置结果在进行数据预处理后构建出深度学习方法所需要的训练集与验证集;其次,使用Python语言和深度学习框架TensorFlow设计实现与本研究问题适配的深度神经网络模型并训练;然后,随机生成了新的桁架结构参数;最后,将深度神经网络输出的传感器布置结果和传统方法的计算结果进行了比较,验证了本研究方法的有效性以及在速度上、可移植性与可扩展性方面的性能优势。     

A novel minimum weight formulation of topology optimization implemented with reanalysis approach

In this paper, we develop an efficient diagonal quadratic optimization formulation for minimum weight design problem subject to multiple constraints. A high-efficiency computational approach of topology optimization is implemented within the framework of approximate reanalysis. The key point of the formulation is the introduction of the reciprocal-type variables. The topology optimization seeking for minimum weight can be transformed as a sequence of quadratic program with separable and strictly positive definite Hessian matrix, thus can be solved by a sequential quadratic programming approach. A modified sensitivity filtering scheme is suggested to remove undesirable checkerboard patterns and mesh dependence. Several typical examples are provided to validate the presented approach. It is observed that the optimized structure can achieve lighter weight than those from the established method by the demonstrative numerical test. Considerable computational savings can be achieved without loss of accuracy of the final design for 3D structure. Moreover, the effects of multiple constraints and upper bound of the allowable compliance upon the optimized designs are investigated by numerical examples.     

考虑关节角加速度约束的仿人机器人偏摆力矩控制方法

针对仿人机器人步行过程中存在的机器人关节角加速度约束影响控制性能的问题，提出一种考虑关节角加速度约束的仿人机器人偏摆力矩控制方法.该方法充分考虑了双臂在摆动过程中对偏摆力矩的影响，根据力矩平衡条件得到需要抵消的偏摆力矩的大小与方向，将偏摆力矩的控制问题转化为带约束条件的二次规划问题，并设计了一种在线变步长迭代算法计算得到优化后的双臂摆动轨迹.实验表明，该方法能有效抵消机器人步行中产生的偏摆力矩，避免控制过程中的"削峰"现象，有效提高机器人的步行稳定性.     

On Cost Aware Cloudlet Placement for Mobile Edge Computing

As accessing computing resources from the remote cloud inherently incurs high end-to-end (E2E) delay for mobile users, cloudlets, which are deployed at the edge of a network, can potentially mitigate this problem. Although some research works focus on allocating workloads among cloudlets, the cloudlet placement aiming to minimize the deployment cost (i.e., consisting of both the cloudlet cost and average E2E delay cost) has not been addressed effectively so far. The locations and number of cloudlets have a crucial impact on both the cloudlet cost in the network and average E2E delay of users. Therefore, in this paper, we propose the Cost Aware cloudlet PlAcement in moBiLe Edge computing (CAPABLE) strategy, where both the cloudlet cost and average E2E delay are considered in the cloudlet placement. To solve this problem, a Lagrangian heuristic algorithm is developed to achieve the suboptimal solution. After cloudlets are placed in the network, we also design a workload allocation scheme to minimize the E2E delay between users and their cloudlets by considering the user mobility. The performance of CAPABLE has been validated by extensive simulations.      

A dual Newton strategy for tree‐sparse quadratic programs and its implementation in the open‐source software treeQP

This paper presents a dual Newton scheme for tree‐sparse quadratic programs as they may arise in the field of stochastic programming. Previous work suggests to introduce auxiliary variables to decompose the tree into scenarios and use Newton's method to solve a dual problem formulation. Following a different approach, we apply the same principle directly on the tree‐sparse problem, avoiding the increase in dimensionality. In combination with a tailored algorithm for the calculation of the step direction, which is typically the most expensive operation per iteration, the proposed algorithm achieves a linear complexity in the number of nodes and supports parallel processing of the tree branches in a stage‐wise fashion. An open‐source implementation of the presented dual Newton strategy is publicly available in treeQP , a toolbox of open‐source solvers for tree‐sparse quadratic programs.     

基于残差决策的自动飞行控制系统远程实时故障诊断

针对自动飞行控制系统结构复杂、关联部件众多,发生故障时诊断时间长,从而影响飞机运行效率的问题,提出一种基于飞机通信寻址报告系统(ACARS)的远程实时故障诊断方案。首先,分析自动飞行控制系统的故障特点,设计搭建检测滤波器;然后,利用ACARS数据链实时发送的自动飞行控制系统的关键信息进行相关部件的残差计算,并根据残差决策算法进行故障诊断及定位;最后,针对不同故障部件残差间的差异大、决策门限无法统一的缺点,提出基于二次差值的残差决策改进算法,减缓了检测对象的整体变化趋势,降低了随机噪声和干扰的影响,避免了将瞬态故障诊断为系统故障的情况。实验仿真结果表明,基于二次差值的改进残差决策算法避免了多决策门限的复杂性,在采样时间为0.1 s的情况下,故障检测所需时间大约为2 s,故障检测时间大幅降低,有效故障检测率大于90%。     

基于广义二次互相关的低信噪比信号时延估计

针对时延估计精度受噪声影响,导致时延估计不准确的问题,在现有广义二次相关算法的基础上,提出了一种改进的广义二次相关算法,通过将二次相关函数先做指数运算,降低噪声干扰,再将傅里叶逆变换得到的相关函数做高次方运算,达到锐化峰值提高时延正确率的目的。仿真结果表明,信噪比(SNR)在0~10 dB时,改进算法的均方根误差明显优于广义二次相关算法,正确率相比于广义二次相关算法也显著提高,且在更低SNR的情况下仍然具有一定优势。     

Fault handling in large water networks with online dictionary learning

Fault detection and isolation in water distribution networks is an active topic due to the nonlinearities of flow propagation and recent increases in data availability due to sensor deployment. Here, we propose an efficient two-step data driven alternative: first, we perform sensor placement taking the network topology into account; second, we use incoming sensor data to build a network model through online dictionary learning. Online learning is fast and allows tackling large networks as it processes small batches of signals at a time. This brings the benefit of continuous integration of new data into the existing network model, either in the beginning for training or in production when new data samples are gathered. The proposed algorithms show good performance in our simulations on both small and large-scale networks.     

Development of a novel algorithm for optimal capacitor placement in distribution systems

Optimal capacitor placement in distribution systems solved by the hybrid method of CODEQ (called HCODEQ method) is proposed in this work. The concepts of chaotic search, opposition-based learning, and quantum mechanics are used in the CODEQ method to overcome the drawback of parameters selection in the differential evolution (DE). However, a larger population size must be used in the CODEQ method. That is a drawback for all evolutionary algorithms (EAs). To overcome this drawback, acceleration operation and migrating operation are embedded into the CODEQ method, i.e. HCODEQ method. The use of these two operations can increase the convergence speed without decreasing the diversity among individuals. One benchmark function and various-scale capacitor placement systems are used to compare the performance of the proposed method, CODEQ method, DE, simulated annealing (SA), and ant system (AS). Numerical results show that the performance of the HCODEQ method is better than the other methods.